An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
نویسندگان
چکیده
State-of-the-art branch-and-bound algorithms for the maximum clique problem (Maxclique) frequently use an upper bound based on a partition P of a graph into independent sets for a maximum clique of the graph, which cannot be very tight for imperfect graphs. In this paper we propose a new encoding from Maxclique into MaxSAT and use MaxSAT technology to improve the upper bound based on the partition P . In this way, the strength of specific algorithms for Maxclique in partitioning a graph and the strength of MaxSAT technology in propositional reasoning are naturally combined to solve Maxclique. Experimental results show that the approach is very effective on hard random graphs and on DIMACS Maxclique benchmarks, and allows to close an open DIMACS problem.
منابع مشابه
An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem
Recently, MaxSAT formalisms are shown very effective for solving combinatorial optimization problems. An importantMaxSAT formalism is weighted partialMaxSAT dealingwith hard clauses, which must be satisfied in all solutions, and soft clauses, which are weighted and can be falsified. In this paper, we apply weighted partial MaxSAT to solve the maximum weight clique (MWC) problem. We first study ...
متن کاملTowards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
The MaxSAT problem and some of its well-known variants find an increasing number of practical applications in a wide range of areas. Examples include different optimization problems in system design and verification. However, most MaxSAT problem instances from these practical applications are too hard for existing branch and bound algorithms. One recent alternative to branch and bound MaxSAT al...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملA branch and bound algorithm for the maximum clique problem
A method to solve the maximum clique problem based on an unconstmin~ quadratic zero-one programming fo~ulation is presented. A branch and bound algorithm for unconstrained quadratic zero-one programming is given that uses a technique to dynamically select variables for the ordering of the branching tree. Dynamic variable selection is equivalent to vertex selection in a similar branch and bound ...
متن کاملMinimum Satisfiability and Its Applications
We define solving techniques for theMinimum Satisfiability Problem (MinSAT), propose an efficient branch-and-bound algorithm to solve the Weighted Partial MinSAT problem, and report on an empirical evaluation of the algorithm onMin-3SAT,MaxClique, and combinatorial auction problems. Techniques solving MinSAT are substantially different from those for the Maximum Satisfiability Problem (MaxSAT)....
متن کامل